An Accelerated Expectation-Maximization Algorithm for Multi-Reference Alignment

نویسندگان

چکیده

The multi-reference alignment (MRA) problem entails estimating an image from multiple noisy and rotated copies of itself. If the noise level is low, one can reconstruct by missing rotations, aligning images, averaging out noise. While accurate rotation estimation impossible if high, rotations still be approximated, thus provide indispensable information. In particular, learning approximation error harnessed for efficient estimation. this paper, we propose a new computational framework, called Synch-EM, that consists angular synchronization followed expectation-maximization (EM). step results in concentrated distribution rotations; learned then incorporated into EM as Bayesian prior. also dramatically reduces search space, load iterations. We show extensive numerical experiments proposed framework significantly accelerate MRA high levels, occasionally few orders magnitude, without degrading reconstruction quality.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Expectation Maximization Algorithm for Textual Unit Alignment

The paper presents an Expectation Maximization (EM) algorithm for automatic generation of parallel and quasi-parallel data from any degree of comparable corpora ranging from parallel to weakly comparable. Specifically, we address the problem of extracting related textual units (documents, paragraphs or sentences) relying on the hypothesis that, in a given corpus, certain pairs of translation eq...

متن کامل

Word Alignment and the Expectation-Maximization Algorithm

The purpose of this tutorial is to give you an example of how to take a simple discrete probabilistic model and derive the expectation maximization updates for it and then turn them into code. We give some examples and identify the key ideas that make the algorithms work. These are meant to be as intuitive as possible, but for those curious about the underlying mathematics, we also provide some...

متن کامل

Expectation Maximization Deconvolution Algorithm

In this paper, we use a general mathematical and experimental methodology to analyze image deconvolution. The main procedure is to use an example image convolving it with a know Gaussian point spread function and then develop algorithms to recover the image. Observe the deconvolution process by adding Gaussian and Poisson noise at different signal to noise ratios. In addition, we will describe ...

متن کامل

The Expectation Maximization Algorithm

This note represents my attempt at explaining the EM algorithm (Hartley, 1958; Dempster et al., 1977; McLachlan and Krishnan, 1997). This is just a slight variation on TomMinka’s tutorial (Minka, 1998), perhaps a little easier (or perhaps not). It includes a graphical example to provide some intuition. 1 Intuitive Explanation of EM EM is an iterative optimizationmethod to estimate some unknown ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 2022

ISSN: ['1053-587X', '1941-0476']

DOI: https://doi.org/10.1109/tsp.2022.3183344